Generalized Labeled LCA Queries
نویسندگان
چکیده
منابع مشابه
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees
Fitch graphs G = (X,E) are di-graphs that are explained by {⊗, 1}-edge-labeled rooted trees with leaf set X: there is an arc xy ∈ E if and only if the unique path in T that connects the least common ancestor lca(x, y) of x and y with y contains at least one edge with label 1. In practice, Fitch graphs represent xenology relations, i.e., pairs of genes x and y for which a horizontal gene transfe...
متن کاملFrom Revisiting the LCA-based Approach to a New Semantics-based Approach for XML Keyword Search
Most keyword search approaches for data-centric XML documents are based on the computation of Lowest Common Ancestors (LCA), such as SLCA and MLCA. In this paper, we show that the LCA is not always a correct search model for processing keyword queries over general XML data. In particular, when an XML database contains relationships among objects, which is quite common in practical data, LCA-bas...
متن کاملProcessamento de consultas baseadas em palavras-chave sobre fluxos XML
XML streams have become a relevant research topic due to the widespread use of applications such as online news, RSS feeds, and dissemination systems. Such streams must be processed rapidly and without retention. Retaining streams could cause data loss due to the large data traffic in continuous processing. This context becomes more complex when thousands of queries must be evaluated simultaneo...
متن کاملComputing Lowest Common Ancestors in Directed Acyclic Graphs
Finding the lowest common ancestor of a given pair of nodes is a fundamental algorithmic problem. In this paper we study the lowest common ancestor(LCA) problem on directed acyclic graphs (DAGs). A lowest common ancestor of two nodes a and b is a node c which is a common ancestor of a and b and no other node is both a common ancestor of a and b and a proper descendant of c. LCA on trees have be...
متن کاملHow to answer a small batch of RMQs or LCA queries in practice
In the Range Minimum Query (RMQ) problem, we are given an array A of n numbers and we are asked to answer queries of the following type: for indices i and j between 0 and n− 1, query RMQ A (i, j) returns the index of a minimum element in the subarray A[i . . j]. Answering a small batch of RMQs is a core computational task in many realworld applications, in particular due to the connection with ...
متن کامل